#include <cstdio>
#include <cstring>
#include <cstdlib>
using namespace std;

const int kMaxN = 10000000;

void MergeSort(int a[], int n) {
	if (n <= 1) {
		return;
	}

	MergeSort(a, n / 2);
	MergeSort(a + n / 2, n - n / 2);

	int k = n - 1;
	int i = n / 2 - 1;
	int j = n - n / 2 - 1;
	while (i >= 0 && j >= 0) {
		if (a[i] > a[j]) {
}

void MergeSort(int a[], int n, int b[], int m) {
